全文获取类型
收费全文 | 594篇 |
免费 | 77篇 |
国内免费 | 19篇 |
专业分类
化学 | 15篇 |
力学 | 1篇 |
综合类 | 13篇 |
数学 | 637篇 |
物理学 | 24篇 |
出版年
2023年 | 5篇 |
2022年 | 17篇 |
2021年 | 20篇 |
2020年 | 16篇 |
2019年 | 28篇 |
2018年 | 15篇 |
2017年 | 27篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 32篇 |
2013年 | 41篇 |
2012年 | 29篇 |
2011年 | 43篇 |
2010年 | 40篇 |
2009年 | 27篇 |
2008年 | 45篇 |
2007年 | 52篇 |
2006年 | 33篇 |
2005年 | 20篇 |
2004年 | 15篇 |
2003年 | 20篇 |
2002年 | 10篇 |
2001年 | 15篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 12篇 |
1997年 | 8篇 |
1996年 | 6篇 |
1995年 | 9篇 |
1994年 | 13篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有690条查询结果,搜索用时 31 毫秒
31.
In a production system, rework process plays an important role in eliminating waste and effectively controlling the cost of manufacturing. Determining the optimal batch size in a system that allows for rework is, therefore, a worthwhile objective to minimize the inventory cost of work-in-processes and the finished goods. In this paper, models for the optimum batch quantity in a multi-stage system with rework process have been developed for two different operational policies. Policy 1 deals with the rework within the same cycle with no shortage and policy 2 deals with the rework done after N cycles, incurring shortages in each cycle. The major components that play a role in minimizing this cost of the system are manufacturing setups, work-in-processes, storage of finished goods, rework processing, waiting-time, and penalty costs to discourage the generation of defectives. The mathematical structure of this rework processing model falls under a nonlinear convex programming problems for which a closed-form solution has been proposed and results are demonstrated through numerical examples, followed by sensitivity analyses of different important parameters. It is concluded that the total cost in policy 2 tends to be smaller than that in policy 1 at lower proportion of defectives if the in-process carrying cost is low. Policy 2 may be preferred when the work-in-process carrying cost is low and the penalty cost is negligible. 相似文献
32.
We consider the Hamiltonian cycle problem embedded in singularly perturbed (controlled) Markov chains. We also consider a functional on the space of stationary policies of the process that consists of the (1,1)‐entry of the fundamental matrices of the Markov chains induced by these policies. We focus on the subset of these policies that induce doubly stochastic probability transition matrices which we refer to as the “doubly stochastic policies.” We show that when the perturbation parameter, ε, is sufficiently small, the minimum of this functional over the space of the doubly stochastic policies is attained at a Hamiltonian cycle, provided that the graph is Hamiltonian. We also show that when the graph is non‐Hamiltonian, the above minimum is strictly greater than that in a Hamiltonian case. We call the size of this difference the “Hamiltonicity Gap” and derive a conservative lower bound for this gap. Our results imply that the Hamiltonian cycle problem is equivalent to the problem of minimizing the variance of the first hitting time of the home node, over doubly stochastic policies. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009 相似文献
33.
本文探讨从事不透明销售的零售商对顾客退货政策的选择问题。分别针对零售商垄断和竞争两种市场情况,建立不透明零售商与其它供应链成员(制造商或普通零售商)之间的博弈模型,获得唯一均衡解;对均衡结果进行结构化分析,给出不透明销售方式下采用全额退款政策的判别条件;针对均衡结果,分析零售商垄断情况下产品不透明参数的最优设计,以及零售商竞争情况下的市场分化情况;鉴于净残值参数在退货政策选择中的决定性作用,本文进一步探讨了净残值为正时全额退款政策对各参与方利润及产品需求和价格的影响,分析了净残值在其中的作用机理。本研究能够为不透明零售商制定退货政策和价格以及其它供应链成员制定相关决策提供支持。 相似文献
34.
This paper discusses a discrete-time Geo/G/1 queue, in which the server operates a random threshold policy, namely 〈p, N〉 policy, at the end of each service period. After all the messages are served in the queue exhaustively, the server is immediately deactivated until N messages are accumulated in the queue. If the number of messages in the queue is accumulated to N, the server is activated for services with probability p and deactivated with probability (1 − p). Using the generating functions technique, the system state evolution is analyzed. The generating functions of the system size distributions in various states are obtained. Some system characteristics of interest are derived. The long-run average cost function per unit time is analytically developed to determine the joint optimal values of p and N at a minimum cost. 相似文献
35.
Yonghui Huang 《Journal of Mathematical Analysis and Applications》2009,359(1):404-140
This paper studies the risk minimization problem in semi-Markov decision processes with denumerable states. The criterion to be optimized is the risk probability (or risk function) that a first passage time to some target set doesn't exceed a threshold value. We first characterize such risk functions and the corresponding optimal value function, and prove that the optimal value function satisfies the optimality equation by using a successive approximation technique. Then, we present some properties of optimal policies, and further give conditions for the existence of optimal policies. In addition, a value iteration algorithm and a policy improvement method for obtaining respectively the optimal value function and optimal policies are developed. Finally, two examples are given to illustrate the value iteration procedure and essential characterization of the risk function. 相似文献
36.
This paper considers a two-level vendor managed inventory (VMI) system comprising a distribution center (DC) and a retailer. Both the DC’s and the retailer’s replenishment decisions follow the order-up-to-level policy and aim at maximizing the profit of the overall system. We critically examine the potential of the DC’s ability to modify delivery decisions, identify and quantify the cost factors that influence the DC’s modification ability, establish a relationship between the DC’s location and its modification ability, and show the trade-off between the DC’s modification ability and related costs. Our analysis provides a new insight into the role of the DC and reveals the full potential of the VMI system. Our findings and their practical implications, demonstrated with the aid of computational examples, are helpful for enhancing the practice of VMI at both strategic and operational levels. 相似文献
37.
This paper studies a single-product, dynamic, non-stationary, stochastic inventory problem with capacity commitment, in which a buyer purchases a fixed capacity from a supplier at the beginning of a planning horizon and the buyer’s total cumulative order quantity over the planning horizon is constrained with the capacity. The objective of the buyer is to choose the capacity at the beginning of the planning horizon and the order quantity in each period to minimize the expected total cost over the planning horizon. We characterize the structure of the minimum sum of the expected ordering, storage and shortage costs in a period and thereafter and the optimal ordering policy for a given capacity. Based on the structure, we identify conditions under which a myopic ordering policy is optimal and derive an equation for the optimal capacity commitment. We then use the optimal capacity and the myopic ordering policy to evaluate the effect of the various parameters on the minimum expected total cost over the planning horizon. 相似文献
38.
Min‐Tsai Lai 《商业与工业应用随机模型》2007,23(6):455-464
This paper considers a periodical replacement model based on a cumulative repair‐cost limit, whose concept uses the information of all repair costs to decide whether the system is repaired or replaced. The failures of the system can be divided into two types. One is minor failure that is assumed to be corrected by minimal repair, while the other is serious failure where the system is damaged completely. When a minor failure occurs, the corresponding repair cost is evaluated and minimal repair is then executed if this accumulated repair cost is less than a pre‐determined limit L, otherwise, the system is replaced by a new one. The system is also replaced at scheduled time T or at serious failure. Long‐run expected cost per unit time is formulated and the optimal period T* minimizing that cost is also verified to be finite and unique under some specific conditions. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
39.
石油与天然气作为我国最重要的矿产资源,其矿权管理采用许可证制度.基于我国的石油与天然气许可证体系结构,分析了石油天然气勘查与开采许可证的实物期权特性,采用实物期权思想对油气勘探开发项目进行战略经济评价,针对传统方法在颁发开采许可证时忽略了时间灵活性价值这一问题,提出了估算颁发开采许可证价值和对投资开发时机进行选择的办法.为资源管理部门和石油公司的决策提供科学依据.最后,应用实物期权法对一个算例进行了分析. 相似文献
40.
任胜兵 《武汉大学学报(理学版)》2006,52(5):644-648
针对基于Web的图书馆管理系统资源访问控制的动态性问题,提出了一种基于角色的访问控制策略描述方案.通过对基于Web的图书馆管理系统访问控制管理影响因素和访问控制需求的分析,结合NIST基于角色的访问控制统一模型标准,构造了一种基于角色的访问控制元模型.并在这一元模型的基础上,提出了一种紧凑的基于角色的访问控制XML策略描述语言框架.结果表明该访问控制策略描述语言框架适合表述动态环境下对图书馆资源的访问策略,提高了基于Web的图书馆管理系统资源访问的安全性. 相似文献